Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions

نویسندگان

  • Yannick Chevalier
  • Ralf Küsters
  • Michaël Rusinowitch
  • Mathieu Turuani
  • Laurent Vigneron
چکیده

We propose a protocol model which integrates two different ways of analyzing cryptographic protocols: i) analysis w.r.t. an unbounded number of sessions and bounded message size, and ii) analysis w.r.t. an a priori bounded number of sessions but with messages of unbounded size. We show that in this model secrecy is DEXPTIME-complete. This result is obtained by extending the Dolev-Yao intruder to simulate unbounded number of sessions. Key-words: Verification, Rewriting, Reasoning about Security, Attack, Protocol, Theorem Proving, Logic and Complexity 1 : LORIA-INRIA-Universités Henri Poincaré, 54506 Vandoeuvre-les-Nancy cedex, France eeeeeee email: {chevalie, rusi, turuani, vigneron}@loria.fr 2 : Department of Computer Science, Stanford University, Stanford CA 94305, USA eeeeeee email: [email protected] ∗ This work was partially supported by PROCOPE and IST AVISPA. The second author was also supported by the DFG. Extension du modèle d’Intru de Dolev-Yao pour l’Analyse d’un Nombre Non Borné de Sessions Résumé : Nous proposons un modèle de protocole intégrant deux moyens différents d’analyser les protocoles cryptographiques: i) analyse par rapport à un nombre non borné de sessions mais des tailles de messages bonées, et ii) analyse par rapport à un nombre de sessions à priori borné mais avec des tailles de messages illimitées. Nous montrons que dans ce modèle, la recherche d’une attaque de secret est DEXPTIME-complète. Ce résultat est obtenu par une extension du modèle d’intrus de Dolev-Yoa permettant de simuler l’exécution d’un nombre non borné de sessions. Mots-clés : Vérification, Réécriture, Analyse de Sécurité, Attaque, Protocole, Preuve Automatique, Logique et Complexité Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions 3

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounded memory protocols

It is well-known that the Dolev-Yao adversary is a powerful adversary. Besides acting as the network, intercepting, decomposing, composing and sending messages, he can remember as much information as he needs. That is, his memory is unbounded. We recently proposed a weaker Dolev-Yao like adversary, which also acts as the network, but whose memory is bounded. We showed that this Bounded Memory D...

متن کامل

Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete

Guessing, or dictionary, attacks arise when an intruder exploits the fact that honest agents executing a security protocol exchange certain data like passwords that may have low entropy, i.e. stem from a small set of values. One way to model such attacks is to formalize a Dolev-Yao-style intruder model with inference rules to capture the additional capabilities of the intruder concerning guessa...

متن کامل

Protocol Insecurity with a Finite Number of Sessions and Composed Keys is NP-complete

We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is decidable in NP with respect to a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports non-atomic symmetric encryption keys. NP-hardness is obtained even for a simple class of protocols ...

متن کامل

Protocol insecurity with a finite number of sessions, composed keys is NP-complete

We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NP-complete with respect to a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports non-atomic symmetric encryption keys. We also prove that in order to build an attack with a fixed numbe...

متن کامل

Verifying a bounded number of sessions and its complexity

We investigate the complexity of the protocol insecurity problem for a finite number of sessions (fixed number of interleaved runs). We show that this problem is NP-complete with respect to a Dolev-Yao model of intruders. The result does not assume a limit on the size of messages and supports asymetric and nonatomic symmetric encryption keys. We also prove that in order to build an attack with ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003